No . 672 FULL - TRUTHFUL IMPLEMENTATION IN NASH EQUILIBRIA
نویسندگان
چکیده
Weconsider full-truthfulNash implementation, which requires that truth telling by each agent should be a Nash equilibrium of a direct revelation mechanism, and that the set of Nash equilibrium outcomes of the mechanism should coincide with the f -optimal outcome. We show that restricted monotonicity together with an auxiliary condition called boundedness is both necessary and sufficient for full-truthful Nash implementation. We also prove that full-truthful Nash implementation is equivalent to secure implementation (Saijo et al. (2005)). This gives us an alternative characterization of securely implementable social choice functions.
منابع مشابه
Full-Truthful Implementation in Nash Equilibria
We consider full-truthful Nash implementation, which requires truth telling by each agent to be a Nash equilibrium of a direct revelationmechanism, and every Nash equilibrium outcome of the mechanism to be f optimal. We show that restricted monotonicity plus an auxiliary condition is necessary and sufficient for full-truthful Nash implementation, and that full-truthful Nash implementation is eq...
متن کاملFULL - TRUTHFUL IMPLEMENTATION IN NASH EQUILIBRIA Hideki Mizukami and
Weconsider full-truthfulNash implementation, which requires that truth telling by each agent should be a Nash equilibrium of a direct revelation mechanism, and that the set of Nash equilibrium outcomes of the mechanism should coincide with the f -optimal outcome. We show that restricted monotonicity together with an auxiliary condition called boundedness is both necessary and sufficient for ful...
متن کاملUsing Nash Implementation to Achieve Better Frugality Ratios
Most of the recent works on algorithmic mechanism design exploit the solution concept of dominant strategy equilibria. Such work designs a proper payment scheme so that selfish agents maximize their utility by truthfully revealing their types. It has been pointed out that these truthful mechanisms, the famous among them being the VCG mechanisms, often incur high payments and fruglity ratios. In...
متن کاملRevenue Maximization via Nash Implementation
We consider the problem of maximizing revenue in prior-free auctions for general single parameter settings. The setting is modeled by an arbitrary downward-closed set system, which captures many special cases such as single item, digital goods and single-minded combinatorial auctions. We relax the truthfulness requirement by the solution concept of Nash equilibria. Implementation by Nash equili...
متن کاملIn defense of exclusionary deliberation: communication and voting with private beliefs and values
Fundamentally, deliberative democracy is an institution in which participants communicate and then vote. We analyze strategic behavior in this type of institution when agents do not necessarily have common beliefs and values. The potential for some pairs of participants to have diametrically opposed preferences makes it difficult to support equilibria in which participants truthfully reveal the...
متن کامل